Expectation values from the single-layer quantum approximate optimization algorithm on Ising problems
نویسندگان
چکیده
We report on the energy-expectation-value landscapes produced by single-layer ($p=1$) Quantum Approximate Optimization Algorithm (QAOA) when being used to solve Ising problems. The are obtained using an analytical formula that we derive. allows us predict landscape for any given problem instance and consequently optimal QAOA parameters heuristically solving QAOA. have validated our showing it accurately reproduces published in recent experimental reports. then applied methods address question: how well is able large benchmark instances? calculate energy-expectation values MAX-CUT problems containing up $7\,000$ vertices $41\,459$ edges. also calculated energy expectations general with $100\,000$ $150\,000$ Our results provide estimate may work run a quantum computer thousands of qubits. In addition providing performance estimates angles used, use investigate difficulties one encounter running practice different classes instances. find depending Hamiltonian, expectation-value can be rather complex, sharp features necessitate highly accurate rotation gates order optimally hardware. present explain some qualitative observed numerically.
منابع مشابه
Approximate Expectation Propagation for Bayesian Inference on Large-scale Problems
where k indexes experimental replicates, i indexes the probe positions, j indexes the binding positions, andN ( jPj aji jjsjbj; i) represents the probability density function of a Gaussian distribution with mean Pj aji jjsjbj and variance i. We assign prior distributions on the binding event bj and the binding strength sj: p(bjj j) = bj j (1 j)1 bj (3) p0(sj) = Gamma(sjjc0; d0) (4) where Gamma(...
متن کاملExpectation Values in Relativistic Coulomb Problems
We evaluate the matrix elements 〈Orp〉, where O = {1, β, iαnβ} are the standard Dirac matrix operators and the angular brackets denote the quantum-mechanical average for the relativistic Coulomb problem, in terms of generalized hypergeometric functions 3F2 (1) for all suitable powers. Their connections with the Chebyshev and Hahn polynomials of a discrete variable are emphasized. As a result, we...
متن کاملComputing Expectation Values for Molecular Quantum Dynamics
We compute expectation values for the solution of the nuclear Schrödinger equation. The proposed particle method consists of three steps: sampling of the initial Wigner function, classical transport of the sampling points, weighted phase space summation for the final computation of the expectation values. The Egorov theorem guarantees that the algorithm is second order accurate with respect to ...
متن کاملBQIABC: A new Quantum-Inspired Artificial Bee Colony Algorithm for Binary Optimization Problems
Artificial bee colony (ABC) algorithm is a swarm intelligence optimization algorithm inspired by the intelligent behavior of honey bees when searching for food sources. The various versions of the ABC algorithm have been widely used to solve continuous and discrete optimization problems in different fields. In this paper a new binary version of the ABC algorithm inspired by quantum computing, c...
متن کاملAn approximate algorithm for combinatorial optimization problems with two parameters
We call a minimum cost restricted time combinatorial optimization (MCRT) problem any problem that has a finite set P, finite family S of subsets of P, non-negative threshold h, and two non-negative real-valued functions y : (say, cost) and x : p......-? R+ (say, time). One seeks a solution F* E S with y(F*) min{y(F): F E S, x(F):S h}, where x(G) L:gEGx(g), y(G) = L:gEGy(g) and G E S. We also as...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quantum science and technology
سال: 2022
ISSN: ['2364-9054', '2364-9062']
DOI: https://doi.org/10.1088/2058-9565/ac9013